Formal Correctness Proof for DPLL Procedure
نویسندگان
چکیده
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware verification. Most of the modern SAT solvers are based on this procedure, extending it with different heuristics. In this paper we present a formal proof that the DPLL procedure is correct. As far as we know, this is the first such proof. The proof was formalized within the Isabelle/Isar proof assistant system. This proof adds to the growing body of formalized mathematical knowledge and it also provides a number of lemmas relevant for proving correctness of modern SAT and SMT solvers.
منابع مشابه
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
We present a formalization and a formal total correctness proof of a MiniSATlike SAT solver within the system Isabelle/HOL. The solver is based on the DPLL procedure and employs most state-of-the art SAT solving techniques, including the conflict-guided backjumping, clause learning, and the two-watched unit propagation scheme. A shallow embedding into Isabelle/HOL is used and the solver is expr...
متن کاملFormalization of Abstract State Transition Systems for SAT
We present a formalization of modern SAT solvers and their properties in a form of abstract state transition systems. SAT solving procedures are described as transition relations over states that represent the values of the solver’s global variables. Several different SAT solvers are formalized, including both the classical DPLL procedure and its state-of-the-art successors. The formalization i...
متن کاملFormal Verification of a Modern SAT Solver
We present a formalization and a formal total correctness proof of a MiniSATlike SAT solver within the system Isabelle/HOL. The solver is based on the DPLL procedure and employs most state-of-the art SAT solving techniques, including the conflict-guided backjumping, clause learning, and the two-watch unit propagation scheme. A shallow embedding into HOL is used and the solver is expressed as a ...
متن کاملImproving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas naturally arising in interactive proofs do not require a state-of-the-art SAT solver, the conversion to clausal form required by DPLL strongly damages the performance of the procedure. In this paper, we present a reflexive...
متن کاملExtracting Proofs from Branch-and-Prune
δ-Complete decision procedures can solve SMT problems over the reals with a wide range of nonlinear functions, allowing “δ-bounded errors”. The scalability of such procedures usually depends on efficient numerical procedures, whose implementation can be error-prone. It is important for δ-complete solvers to provide certificates to prove the correctness of their answers. We show how to do this f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Informatica, Lith. Acad. Sci.
دوره 21 شماره
صفحات -
تاریخ انتشار 2010